Thread: How to get char[200]

  1. #1
    Registered User
    Join Date
    Oct 2007
    Posts
    3

    How to get char[200]

    how??

    Help plz...

    thks for ur kindness

  2. #2
    Hurry Slowly vart's Avatar
    Join Date
    Oct 2006
    Location
    Rishon LeZion, Israel
    Posts
    6,786
    char x[200];

    what do you mean by get?
    All problems in computer science can be solved by another level of indirection,
    except for the problem of too many layers of indirection.
    – David J. Wheeler

  3. #3
    Guest Sebastiani's Avatar
    Join Date
    Aug 2001
    Location
    Waterloo, Texas
    Posts
    5,708
    your question doesn't really make sense - perhaps you could be a little more discriptive?
    Code:
    #include <cmath>
    #include <complex>
    bool euler_flip(bool value)
    {
        return std::pow
        (
            std::complex<float>(std::exp(1.0)), 
            std::complex<float>(0, 1) 
            * std::complex<float>(std::atan(1.0)
            *(1 << (value + 2)))
        ).real() < 0;
    }

  4. #4
    Registered User
    Join Date
    Oct 2007
    Posts
    3
    Input character,where n<=200

  5. #5
    Hurry Slowly vart's Avatar
    Join Date
    Oct 2006
    Location
    Rishon LeZion, Israel
    Posts
    6,786
    use fgets
    All problems in computer science can be solved by another level of indirection,
    except for the problem of too many layers of indirection.
    – David J. Wheeler

  6. #6
    Registered User
    Join Date
    Oct 2007
    Posts
    3
    can i use gets??

  7. #7
    Woof, woof! zacs7's Avatar
    Join Date
    Mar 2007
    Location
    Australia
    Posts
    3,459

  8. #8
    Deathray Engineer MacGyver's Avatar
    Join Date
    Mar 2007
    Posts
    3,210
    Yes, you can use it.... same way you can play Russian Roulette. It's not safe. Should you do it? No.

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Convert string to char[200]
    By maxorator in forum C++ Programming
    Replies: 4
    Last Post: 08-22-2005, 01:01 PM